Heuristics for Determining the Elimination Ordering in the Influence Diagram Evaluation with Binary Trees

نویسندگان

  • Rafael Cabañas
  • Andrés Cano
  • Manuel Gómez-Olmedo
  • Anders L. Madsen
چکیده

Finding an optimal elimination ordering is a NP-hard problem of crucial importance for the efficiency of the Influence Diagrams evaluation. Some of the traditional methods for determining the elimination ordering use heuristics that consider that potentials are represented as tables. However, if potentials are represented using binary trees traditional methods may not offer the best results. In the present paper, two new heuristics that consider that potentials are represented as binary trees are proposed. As a result, the storage requirements for evaluating an ID with binary trees is reduced.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An ordering heuristic to develop the binary decision diagram based on structural importance

Fault tree analysis is often used to assess risks within industrial systems. The technique is commonly used although there are associated limitations in terms of accuracy and efficiency when dealing with large fault tree structures. The most recent approach to aid the analysis of the fault tree diagram is the Binary Decision Diagram (BDD) methodology. To utilise the technique the fault tree str...

متن کامل

Comparison of variable ordering heuristics / algorithms for binary decision diagrams

Fault tree analysis is a commonly used technique to assess the systems reliability performance in terms of its components reliability characteristics. More recently, the Binary Decision Diagram (BDD) methodology has been introduced which significantly aids the analysis of the fault tree diagram. The approach has been shown to improve both the efficiency of determining the minimal cut sets of th...

متن کامل

A Survey of Static Variable Ordering Heuristics for Efficient BDD/MDD Construction

The problem of finding an optimal variable ordering for Binary Decision Diagrams (BDD) or Multi-Valued Decision Diagrams (MDD) is widely known to be NP-Complete. This paper presents a survey of static heuristic techniques applied to ordering the variables of the BDD/MDD under construction in order to minimize the overall size of the resulting decision diagram.

متن کامل

An ordering heuristic to develop the binary decision diagram based on structural importance

Fault tree analysis is often used to assess risks within industrial systems. The technique is commonly used although there are associated limitations in terms of accuracy and efficiency when dealing with large fault tree structures. The most recent approach to aid the analysis of the fault tree diagram is the Binary Decision Diagram (BDD) methodology. To utilise the technique the fault tree str...

متن کامل

Choosing a heuristic for the "fault tree to binary decision diagram" conversion, using neural networks

Fault-tree analysis is commonly used for risk assessment of industrial systems. Several computer packages are available to carry out the analysis. Despite its common usage there are associated limitations of the technique in terms of accuracy and efficiency when dealing with large fault-tree structures. The most recent approach to aid the analysis of the fault-tree diagram is the BDD (binary de...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013